Abstract:

During dealing with massive data sets, a single computer’s power is limited. The traditional clustering algorithms are difficult to obtain the results in the short time. To overcome these problems, a new parallel clustering algorithm is presented according to the analysis of clustering algorithm based on density and adaptive densityreachable. Theoretical analysis and experimental results demonstrate that the algorithm is nearlinear speedup ratio, and can handle the massive data sets effectively.

Key words: parallel clustering, massive data sets, cluster computer